Benchmarking Flexible Electric Loads Scheduling Algorithms
نویسندگان
چکیده
Because of increasing amounts intermittent and distributed generators in power systems, many demand response programs have been developed to schedule flexible energy consumption. However, proper benchmarks for comparing these methods are lacking, especially when decisions made based on information which is repeatedly updated. This paper presents a new benchmarking tool designed bridge this gap. Surveys that classify flexibility planning algorithms were an input define the standards. The framework can be used different objectives under diverse conditions faced by electricity stakeholders interested scheduling algorithms. It includes simulation environment captures evolution look--ahead information, enables online test seven measuring their performance uncertain market conditions. results show importance decision making, influence data quality algorithm performance, benefit using robust stochastic programming approaches, necessity trustworthy benchmarking.
منابع مشابه
Benchmarking the Task Graph Scheduling Algorithms
The problem of scheduling a weighted directed acyclic graph (DAG) to a set of homogeneous processors to minimize the completion time has been extensively studied. The NPcompleteness of the problem has instigated researchers to propose a myriad of heuristic algorithms. While these algorithms are individually reported to be efficient, it is not clear how effective they are and how well they compa...
متن کاملThree Algorithms for Flexible Flow-shop Scheduling
Scheduling is an important process widely used in manufacturing, production, management, computer science, and so on. Appropriate scheduling can reduce material handling costs and time. Finding good schedules for given sets of jobs can thus help factory supervisors effectively control job flows and provide solutions for job sequencing. In simple flow shop problems, each machine operation center...
متن کاملBenchmarking and Comparison of the Task Graph Scheduling Algorithms
Abstract The problem of scheduling a parallel program represented by a weighted directed acyclic graph (DAG) to a set of homogeneous processors for minimizing the completion time of the program has been extensively studied. The NP-completeness of the problem has stimulated researchers to propose a myriad of heuristic algorithms. While most of these algorithms are reported to be efficient, it is...
متن کاملImproved teaching–learning-based and JAYA optimization algorithms for solving flexible flow shop scheduling problems
Flexible flow shop (or a hybrid flow shop) scheduling problem is an extension of classical flow shop scheduling problem. In a simple flow shop configuration, a job having ‘g’ operations is performed on ‘g’ operation centres (stages) with each stage having only one machine. If any stage contains more than one machine for providing alternate processing facility, then the problem...
متن کاملApproximation Algorithms for Wireless Link Scheduling with Flexible Data Rates
We consider scheduling problems in wireless networks with respect to flexible data rates. That is, more or less data can be transmitted per time depending on the signal quality, which is determined by the signal-to-interference-plus-noise ratio (SINR). Each wireless link has a utility function mapping SINR values to the respective data rates. We have to decide which transmissions are performed ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Energies
سال: 2021
ISSN: ['1996-1073']
DOI: https://doi.org/10.3390/en14051269